Achieving high coverage for floating-point code via unconstrained programming
نویسندگان
چکیده
منابع مشابه
Floating Point to Fixed Point Conversion of C Code
In processors that do not support floating-point instructions, using fixed-point arithmetic instead of floating-point emulation trades off computation accuracy for execution speed. This trade-off is often profitable. In many cases, like embedded systems, low-cost and speed bounds make it the only acceptable option. We present an environment supporting fixed-point code generation from C programs...
متن کاملHigh-Performance Floating Point Divide
In modern processors floating point divide operations often take 20 to 25 clock cycles, five times that of multiplication. Typically multiplicative algorithms with quadratic convergence are used for high-performance divide. A divide unit based on the multiplicative Newton-Raphson iteration is proposed. This divide unit utilizes the higher-order Newton-Raphson reciprocal approximation to compute...
متن کاملFloating-point bitwidth analysis via automatic differentiation
Automatic bitwidth analysis is a key ingredient for highlevel programming of FPGAs and high-level synthesis of VLSI circuits. The objective is to find the minimal number of bits to represent a value in order to minimize the circuit area and to improve efficiency of the respective arithmetic operations, while satisfying user-defined numerical constraints. We present a novel approach to bitwidth ...
متن کاملCode Coverage Analysis for Concurrent Programming Languages Using High-Level Decision Diagrams
The paper presents using high-level decision diagram (HLDD) as a suitable graph model for code coverage analysis in concurrent programming languages. The authors show that HLDD models are scalable and compact models for realistic problems can be automatically obtained. At the same time they allow covering paths of non-blocking assignments, which conventional code coverage metrics designed for p...
متن کاملQ-adic Floating-point Transform revisited: arithmetic over small extension field via floating point routines
We present an algorithm to perform arithmetic operations over small extension field via numerical routines. The idea is to convert the X-adic representation of modular polynomials, with X an indeterminate, to a q-adic representation where q is a prime power larger than the field characteristic. With some control on the different involved sizes it is then possible to perform some of the q-adic a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2017
ISSN: 0362-1340,1558-1160
DOI: 10.1145/3140587.3062383